The Crowd-Median Algorithm

نویسندگان

  • Hannes Heikinheimo
  • Antti Ukkonen
چکیده

The power of human computation is founded on the capabilities of humans to process qualitative information in a manner that is hard to reproduce with a computer. However, all machine learning algorithms rely on mathematical operations, such as sums, averages, least squares etc. that are less suitable for human computation. This paper is an effort to combine these two aspects of data processing. We consider the problem of computing a centroid of a data set, a key component in many data-analysis applications such as clustering, using a very simple human intelligence task (HIT). In this task the workers must choose the outlier from a set of three items. After presenting a number of such triplets to the workers, the item chosen the least number of times as the outlier is selected as the centroid. We provide a proof that the centroid determined by this procedure is equal the mean of a univariate normal distribution. Furthermore, as a demonstration of the viability of our method, we implement a human computation based variant of the k-means clustering algorithm. We present experiments where the proposed method is used to find an “average” image in a collection, and cluster images to semantic categories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting of People in the Extremely Dense Crowd using Genetic Algorithm and Blobs Counting

Received Nov 13, 2012 Revised Accepted In this paper, we have proposed a framework to count the moving person in the video automatically in a very dense crowd situation. Median filter is used to segment the foreground from the background and blob analysis is done to count the people in the current frame. Optimization of different parameters is done by using genetic algorithm. This framework is ...

متن کامل

Counting of People in the Extremely Dense Crowd

Received Nov 13,2012 Revised Jan 05, 2013 Accepted Jan 12,2013 In this paper, we have proposed a framework to count the moving person in the video automatically in a very dense crowd situation. Median filter is used to segment the foreground from the background and blob analysis is done to count the people in the current frame. Optimization of different parameters is done by using genetic algor...

متن کامل

Improved Adaptive Median Filter Algorithm for Removing Impulse Noise from Grayscale Images

Digital image is often degraded by many kinds of noise during the process of acquisition and transmission. To make subsequent processing more convenient, it is necessary to decrease the effect of noise. There are many kinds of noises in image, which mainly include salt and pepper noise and Gaussian noise. This paper focuses on median filters to remove the salt and pepper noise. After summarizin...

متن کامل

A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem

Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...

متن کامل

X Consensus via small group interactions: the importance of triads

We consider a framework for crowdsourcing in which “the wisdom of the crowd” is elicited through a consensus process. In our setting, a set of participants submit proposals for a given question of interest. An algorithm designer would like to find the (generalized) median of this set, but does not have access to information about the metric space that the proposals lie in. The goal is then to d...

متن کامل

Large-Scale Decision-Making via Small Group Interactions: the Importance of Triads1

We study a framework for large-scale decision-making through small group interactions. In this framework, a crowd of participants interact with each other through a sequence of small group interactions, the composition of which are chosen by an algorithm designer, or in some settings, by nature. We consider the problem of finding the wisdom of the crowd, which we take to be the generalized medi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013